Search results for "Variable memory"

showing 1 items of 1 documents

Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes *

2013

A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the dynamics of $(S_t)$. This so-called "persistent" random walk is nolonger Markovian and, under suitable conditions, the rescaled process converges towards the integrated telegraph noise (ITN) as the time-scale and space-scale parameters tend to zero (see Herrmann and Vallois, 2010; Tapiero-Vallois, Tapiero-Vallois2}). The ITN process is effectively non-Markovian too. The aim is to consider persistent random walks $(S_t)$ whose increments are Markov chains with…

[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]Variable length Markov chainProbability (math.PR)Semi Markov processesIntegrated telegraph noise[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]Mathematics::ProbabilitySimple and double infinite combs.Variable memoryFOS: Mathematics[ MATH.MATH-PR ] Mathematics [math]/Probability [math.PR]Mathematics - ProbabilityPersistent random walkSimple and double infinite combsPiecewise Deterministic Markov Processes
researchProduct